Axiomatisation of an Interval Calculus for Theorem Proving
نویسندگان
چکیده
منابع مشابه
Axiomatisation of an Interval Calculus for Theorem Proving
We provide an axiomatisation of the Timed Interval Calculus, a set-theoretic notation for expressing properties of time intervals. We implement the axiomatisation in the Ergo theorem prover in order to automatically prove laws for reasoning about predicates expressed using interval operators. These laws can be then used in the automatic veriication of real-time applications.
متن کاملModel Generation Theorem Proving with Interval Constraints
We investigate how the deduction paradigm of model generation theorem proving can be enhanced with intervaland extraval-based constraints leading to more e cient model generation in for some nite domain problems. 1 Model Generation Model generation (MG) is a sound and complete inference rule for rst-order predicate logic for input in conjunctive normal form (CNF). One can view it as a positive ...
متن کاملNormal Form Theorem Proving for the Lambek Calculus
The possibility of multiple equivalent proofs presents a problem for efficient parsing of a number of flexible categorial grammar (CG) frameworks. In this paper I outline a normal form system for a sequent formulation of the product-free associative Lambek Calculus. This le,'~ls to a simple parsing approach that yields only normal form proofs. This approach is both ~afe in that all distinct rea...
متن کاملTowards an Open System for Theorem Proving towards an Open System for Theorem Proving
In this contribution I advocate an open system for formalised mathematical reasoning that is able to capture diierent mathematical formalisms as well as a wide variety of proof formats. This is assumed to be much more adequate since it more closely reeects the situation in mathematics as a whole. In particular I try to classify diierent dimension according to which proofs can be classiied.
متن کاملAn Ordinal Calculus for Proving Termination inTerm
In this article, we are concerned with the proofs of termination of rewrite systems by the method of interpretations. We propose a modiied approach to subrecursive hierarchies of functions by means of a syntactical approach to ordinal recursion. Our method appears to be appropriate for nding interpretations in a systematic way. We provide several examples of applications. It is shown that three...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80879-x